On the General Position of Special Polygons
نویسنده
چکیده
We adopt the following rules: i, j, k, n denote natural numbers, a, b, c, x denote sets, and r denotes a real number. The following four propositions are true: (1) If 1 < i, then 0 < i − 1. (2) If 1 ¬ i, then i − 1 < i. (3) 1 is odd. (4) Let given n, f be a finite sequence of elements of E T , and given i. If 1 ¬ i and i + 1 ¬ len f, then fi ∈ rng f and fi+1 ∈ rng f. This work has been partially supported by CALCULEMUS grant HPRN-CT-2000-00102.
منابع مشابه
On the General Position of Special Polygons1
In this paper we introduce the notion of general position. We also show some auxiliary theorems for proving Jordan curve theorem. The following main theorems are proved: 1. End points of a polygon are in the same component of a complement of another polygon if number of common points of these polygons is even; 2. Two points of polygon L are in the same component of a complement of polygon M if ...
متن کاملFinding the Maximum Area Axis-parallel Rectangle in a Polygon
We consider the geometric optimization problem of nding the maximum area axis-parallel rectangle (MAAPR) in an n-vertex general polygon. We characterize the MAAPR for general polygons by considering di erent cases based on the types of contacts between the rectangle and the polygon. We present a general framework for solving a key subcase of the MAAPR problem which dominates the running time fo...
متن کاملA New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity
Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...
متن کاملInducing Polygons of Line Arrangements
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for A in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound. Eligible for best student paper
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملThe effect of Neyshabur’s social environment on writing Shaykh Saduq’s Amali
Context affects the author and his writing. Consideration of this effect on Amali books has been less studied. Amali are hadith-historical books that are not compiled by a Muḥaddith. Therefore, environmental factors such as context are effective in selection, summarization and emphasis on its topics. Due to the special position of Shaykh Saduq among Shiite Amali are hadith-historical books that...
متن کامل